A Geometrical Approach to Imprimitive Graphs
نویسندگان
چکیده
We establish a geometrical framework for the study of imprimitive, G-symmetric graphs F by exploiting the fact that any G-partition B of the vertex set VT gives rise both to a quotient graph fB and to a tactical configuration D(B) induced on each block B e B . We also examine those cases in which D(B) is degenerate, and characterize the possible graphs f in many cases where the quotient FB is either a complete graph or a circuit. When D(fl) is non-degenerate, a natural extremal case occurs when D(B) is a symmetric 2-design with stabilizer G(B) acting doubly transitively on points: we characterize such graphs in the case where TB is complete.
منابع مشابه
Solution to a Question on a Family of Imprimitive Symmetric Graphs
We answer a recent question posed by Li et al. [‘Imprimitive symmetric graphs with cyclic blocks’, European J. Combin. 31 (2010), 362–367] regarding a family of imprimitive symmetric graphs. 2000 Mathematics subject classification: primary 05C25; secondary 05E99.
متن کاملImprimitive Distance-Transitive Graphs with Primitive Core of Diameter at Least 3
A distance-transitive graph G is one upon which the automorphism group acts transitively on ordered pairs of vertices at every fixed distance. Only connected graphs need to be considered. Those of diameter 2 are the rank-3 graphs, whose careful study was initiated by Donald G. Higman in his breakthrough paper [16]. A huge amount of effort has gone into the classification of all finite distancet...
متن کاملDistance regular covers of the complete graph
Distance regular graphs fall into three families: primitive, antipodal, and bipar-tite. Each antipodal distance regular graph is a covering graph of a smaller (usually primitive) distance regular graph; the antipodal distance graphs of diameter three are covers of the complete graph, and are the first non-trivial case. Many of the known examples are connected with geometric objects, such as pro...
متن کاملOn the metric dimension of imprimitive distance-regular graphs
A resolving set for a graph Γ is a collection of vertices S, chosen so that for each vertex v, the list of distances from v to the members of S uniquely specifies v. The metric dimension of Γ is the smallest size of a resolving set for Γ. Much attention has been paid to the metric dimension of distance-regular graphs. Work of Babai from the early 1980s yields general bounds on the metric dimens...
متن کاملImprimitive Symmetric Graphs
A finite graph Γ is said to be G-symmetric if G is a group of automorphisms of Γ acting transitively on the ordered pairs of adjacent vertices of Γ. In most cases, the group G acts imprimitively on the vertices of Γ, that is, the vertex set of Γ admits a nontrivial G-invariant partition B. The purpose of this thesis is to study such graphs, called imprimitive G-symmetric graphs. In the first pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995